On average throughput and alphabet size in network coding
نویسندگان
چکیده
منابع مشابه
Average Throughput with Linear Network Coding over Finite Fields: The Combination Network Case
Recommended by Andrej Stefanov We characterize the average linear network coding throughput, T avg c , for the combination network with min-cut 2 over an arbitrary finite field. We also provide a network code, completely specified by the field size, achieving T avg c for the combination network.
متن کاملAlphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach
We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can be arbitrary. Secure network coding is applied to prevent the source information from being leaked to the wiretappers. In secure network coding, the required alphabet size is an op...
متن کاملOptimal Coding for the Erasure Channel with Arbitrary Alphabet Size
An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes and linear random codes...
متن کاملOn Field Size and Success Probability in Network Coding
Using tools from algebraic geometry and Gröbner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear network coding. These estimates take into account which monomials occur in the support of the determinant o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2006.874433